1425F - Flamingoes of Mystery - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
#define fi first
#define se second
#define LSOne(S) ((S) (-S))

void solve() {
	int n;
	
	scanf("%d", &n);
	ll tot, s = 0, x;
	vll a(n+1);
	printf("? 1 %d\n", n);
	fflush(stdout);
	scanf("%lld", &tot);
	for(int i = 2; i < n; i++) {
		printf("? %d %d\n", i, n);
		fflush(stdout);
		scanf("%lld", &x);
		a[i-1] = tot - x - s;
		s += a[i-1];
	}
	ll xd;
	printf("? %d %d\n", 1, n-1);
	fflush(stdout);
	scanf("%lld", &xd);
	a[n] = tot - xd;
	a[n-1] = tot - s - a[n];
	printf("! ");
	for(int i = 1; i <= n; i++) {
		printf("%lld ", a[i]);
	}
	printf("\n");
}

int main() {
	//ios::sync_with_stdio(0); cin.tie(0);
	int T = 1;
	
	//cin >> T;
	while(T--) {
		solve();
	}
	return 0;
}